Embedding of Complete and Nearly Complete Binary Trees into Hypercubes
نویسنده
چکیده
A new simple algorithm for optimal embedding of complete binary trees into hypercubes as well as a node-by-node algorithm for embedding of nearly complete binary trees into hypercubes are presented.
منابع مشابه
Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
We study the embedding problem of enhanced and augmented hypercubes into complete binary trees. Using tree traversal techniques, we compute minimum average edge-congestion of enhanced and augmented hypercubes into complete binary trees.
متن کاملOptimal Dynamic Edge-Disjoint Embeddings of Complete Binary Trees into Hypercubes
The double-rooted complete binary tree is a complete binary tree where the path (of length ) between the children of the root is replaced by a path of length . It is folklore that the double-rooted complete binary tree is a spanning tree of the hypercube of the same size. Unfortunately, the usual construction of an embedding of a double-rooted complete binary tree into the hypercube does not pr...
متن کاملEmbedding of Hypercubes into Complete Binary Trees
We estimate and characterize the edge congestion-sum measure for embeddings of hypercubes into complete binary trees. Our algorithms produce optimal values of sum of edge-congestions in linear time.
متن کاملOptimal Dynamic Embeddings of Complete Binary Trees into Hypercubes
It is folklore that the double-rooted complete binary tree is a spanning tree of the hypercube of the same size. Unfortunately, the usual construction of an embedding of a double-rooted complete binary tree into a hypercube does not provide any hint on how this embedding can be extended if each leaf spawns two new leaves. In this paper, we present simple dynamic embeddings of double-rooted comp...
متن کاملEecient Dynamic Embeddings of Binary Trees into Hypercubes
In this paper, a deterministic algorithm for dynamically embedding binary trees into hypercubes is presented. Because of a known lower bound, any such algorithm must use either randomization or migration, i.e., remapping of tree vertices, to obtain an embedding of trees into hypercubes with small dilation, load, and expansion simultaneously. Using migration of previously mapped tree vertices, t...
متن کامل